Methods and Nodes for Distribution of Content to Consumers

ABSTRACT

Methods and nodes ( 200, 202 ) in a data distribution network, for distributing content to multiple consuming nodes (C 1,  C 2,  C 3, . . .  ). A first node ( 200 ) detects ( 2:2 ) multiple data flows ( 2:1   b ) of a first content from the first node to a second node ( 202 ) in the distribution network, when the first node operates as delivering node of the first content for the consuming nodes. The first node then instructs ( 2:4 ) the second node to operate as delivering node of the first content for the consuming nodes and redirects ( 2:5 ) the consuming nodes to use the second node as delivering node of the first content. The first node further reduces ( 2:6 ) the multiple data flows to a common data flow of the first content to the second node. Thereby, efficiency can be improved in the data distribution network by reducing the number of data flows between the first and second nodes.

TECHNICAL FIELD

The present disclosure relates generally to methods and nodes in a datadistribution network, for distributing content to multiple consumingnodes connected to the network.

BACKGROUND

In the field of data handling, clients such as different serviceproviders, companies, enterprises, organizations and authorities have aneed for hardware and software resources in order to createinfrastructure for various internet or web applications. In this field,the term “resources” is often used for short to represent any hardwareand software that can be used for computer executed operations whenproviding such applications including data processing, calculations,compilations and data storing.

In traditional solutions, the clients themselves own and maintain allthe resources they need which can be quite costly and time-consuming,though, also requiring considerable knowledge to acquire and installsuch resources which further may quickly become out-of-date due to thecurrent rapid development of new techniques and products. Anotherproblem is that a client may need a great amount of resources for a verylimited period, while very little resources are used otherwise. Theclient thus has to make investments in resources enough to cope withsuch temporary peak usage.

In recent years, the concept of cloud computing has emerged to solve theabove problems for clients who instead can utilize pooled resourcesmaintained by cloud providers in large data centers with a huge range ofcomputers and data storages. Effectively, all the needed resources andcapacity are available from the cloud provider and the clients do nothave to make their own investments in costly resources. A client is thusable to contact a cloud provider to create a so-called “Virtual Machine”(VM) comprising resources allocated in the cloud as needed and requiredby the client who can then use the VM basically in the same way as ifcorresponding resources were owned and hosted by the client himself. Thebenefits for clients with cloud computing thus include reduced costs forinvestments and maintenance, and greater flexibility and scalability ofthe resources as needed. There are also solutions with distributed cloudwhere the resources are hired from multiple private nodes and devices,thus offloading the central data centers.

For services involving delivery of content to consumers, e.g.audio/video media, images, web pages and notifications, the amount ofdata to deliver may be substantial and it has become generally desirableto reduce the amount of data traffic and the latency in datadistribution networks used for transporting such data to the consumerswhen delivering requested content. Therefore, solutions have beendeveloped where the content is delivered from a plurality of nodeslocated more close to the receiving consumer, instead of all the wayfrom a single centralized service node, the nodes thus forming adistributed content delivery network. This arrangement can be regardedas a distributed cloud of content delivering resources. The deliverypath between content source and consumer can thus be shortened and loadis distributed over several nodes which may work as caches for temporarystorage of highly demanded content. This may also reduce the latency,i.e. waiting time, in the network. In this way, content can be deliveredto consumers faster and with increased efficiency.

However, the above-described de-centralized solution for contentdelivery is somewhat static and a considerable amount of manual work isrequired to establish and configure suitable nodes for delivering acertain content. For example, it may be necessary to agree with nodeowners and operators where to arrange the delivering nodes, and toconfigure them for achieving the needed networking functionality.Moreover, if the demands for content change, the selection andconfiguration of the delivering nodes must be adapted accordingly,requiring further manual work, to preserve the positive effects ofefficient content delivery, low traffic load and reduced latencymentioned above. Unless such manual work is spent on selecting andconfiguring suitable delivering nodes according to changing demands forcontent, a setup of distributed delivering nodes will soon enough becomeout of date and lose its efficiency. As a result, more resources andbandwidth will be utilized in the network than necessary.

SUMMARY

It is an object of embodiments described herein to address at least someof the problems and issues outlined above. It is possible to achievethis object and others by using methods and nodes as defined in theattached independent claims.

According to one aspect, a method is performed by a first node in a datadistribution network, for distributing content to multiple consumingnodes connected to the data distribution network. In this method, thefirst node detects multiple data flows of a first content from the firstnode to a second node in the distribution network, when the first nodeoperates as delivering node of the first content for the consumingnodes. The first node then instructs the second node to operate asdelivering node of the first content for the consuming nodes andredirects the consuming nodes to use the second node as delivering nodeof the first content. The first node further reduces the multiple dataflows to a common data flow of the first content to the second node.

In this way, the multiple data flows of the same content over a linkbetween the first and second nodes will be reduced to a single commondata flow that is sufficient to get the needed data across this link.This has been achieved by delegating the function of delivering nodefrom the first node to the next downstream node, i.e. the second node.The efficiency has thereby been improved in the data distributionnetwork since the content is delivered to all consuming nodes with lessoccupation of resources, reduced latency and shorter communication pathbetween delivering node and consuming nodes, as compared to having themultiple data flows of the same content between the first and secondnodes.

According to another aspect, a first node is provided in a datadistribution network. The first node is configured to distribute contentto multiple consuming nodes connected to the data distribution networkand comprises a delivery unit adapted to send data flows with contentover the distribution network. The first node also comprises a detectingunit adapted to detect multiple data flows of a first content from thefirst node to a second node in the distribution network when the firstnode operates as delivering node of the first content for the consumingnodes. The first node further comprises an instructing unit adapted toinstruct the second node to operate as delivering node of the firstcontent for the consuming nodes, and a redirecting unit adapted toredirect the consuming nodes to use the second node as delivering nodeof the first content. In the first node, the delivery unit is alsoadapted to reduce the multiple data flows to a common data flow of thefirst content to the second node.

According to yet another aspect, a method is performed by a second nodein a data distribution network, for distributing content to multipleconsuming nodes connected to the data distribution network. In thismethod, the second node receives an instruction from a first node in thedata distribution network to operate as delivering node of a firstcontent for the consuming nodes when multiple data flows of the firstcontent to the second node have been detected in the first node. Thesecond node then operates as delivering node of the first content bysending multiple data flows to the consuming nodes while a common dataflow of the first content is received from the first node.

According to yet another aspect, a second node is provided in a datadistribution network, the second node being configured to distributecontent to multiple consuming nodes connected to the data distributionnetwork. The second node comprises a receiving unit which is adapted toreceive an instruction from a first node in the data distributionnetwork to operate as delivering node of a first content for theconsuming nodes when multiple data flows of the first content to thesecond node have been detected in the first node. The second node alsocomprises an operating unit adapted to operate as delivering node of thefirst content by sending multiple data flows to the consuming nodeswhile a common data flow of the first content is received from the firstnode.

The above methods and nodes may be configured and implemented accordingto different optional embodiments to accomplish further features andbenefits, to be described below.

BRIEF DESCRIPTION OF DRAWINGS

The solution will now be described in more detail by means of exemplaryembodiments and with reference to the accompanying drawings, in which:

FIG. 1 is a flow chart illustrating a procedure in a first node of adata distribution network, according to some possible embodiments.

FIG. 2 is a block diagram illustrating a communication scenario in adata distribution network, according to further possible embodiments.

FIGS. 3 a-f are schematic diagrams illustrating how delivery of contentcan automatically be made more efficient in a data distribution network,according to further possible embodiments.

FIG. 4 is a block diagram illustrating a first node and a second node inmore detail, according to further possible embodiments.

FIG. 5 is a flow chart illustrating a procedure in a second node of adata distribution network, according to further possible embodiments.

FIGS. 6 a and 6 b are flow charts illustrating procedures in a firstnode and a second node, respectively, according to further possibleembodiments.

DETAILED DESCRIPTION

Briefly described, a solution is provided to enable reduced traffic andmore efficient use of resources and bandwidth in a data distributionnetwork when content is delivered to multiple communication devices andterminals of content consuming users. In the following description, theterm “consuming nodes” will be used to represent any such communicationdevices and terminals to which content can be delivered over the datadistribution network. A consuming node is thus a termination point inthe network for the delivered content. Originally, content is deliveredfrom a “source node” controlled and operated by a content provider, andthe content, in the form of encoded data, is often transferred via aplurality of intermediate nodes in the network, using a suitabletransport protocol, before reaching a terminating consumer node. Theseintermediate nodes merely act as data relaying nodes and the datatraffic through them and over their connecting links may sometimes beconsiderable thus causing quite high load and even congestion in thenetwork.

It has been understood in this solution that several duplicateddownstream data flows may occur from one node to another in the deliverypath, where all these flows comprise data of the same content which isdelivered roughly at the same time to multiple consuming nodes havingrequested that particular content. For example, a node in the network,operating as a delivering node of the content for multiple consumingnodes, may establish a downstream data flow towards each one of theconsuming nodes and these data flows may be routed over the sameintermediate node in the network before branching out towards thedifferent consuming nodes. The content is thus distributed to multipleconsuming nodes in a multi-cast manner, meaning that users are“watching” or “subscribing” to the same content at roughly the sametime. In this context, “roughly” may imply that the difference in timebetween the data flows does not exceed a maximum time which may belimited by the type of content and the size of data storage used in thenodes involved.

In this disclosure, the term “delivering node” is defined as a node in adata distribution network that delivers content by repeatedly receivingand processing data requests from a downstream consuming node andsending the requested data in chunks to the consuming node in responsethereto, which process is repeated over and over for successive datachunks of the content, thus generating the data flow, until all thecontent has been delivered. A session is thus established and maintainedbetween the delivering node and the consuming node for the data flow.

The data distribution network topology for this particular content canbe identified as a tree structure with the delivering node as a root andthe multiple consuming nodes as leaves of the tree which are connectedto the delivering node via various intermediate nodes, thus formingdifferent distribution paths to the consuming nodes. The nodes in such anetwork may also be denoted “parents” (i.e. upstream nodes) and“children” (i.e. downstream nodes) depending on their positions relativeone another. The tree structure or network topology of such adistribution pattern of a particular content may be referred to as a“distribution tree”. Even though the content is distributed over anetwork which can be represented as a more or less fully connectedgraph, i.e. all nodes are connected to one another, it is possible andpractical to reduce the full graph to a tree, hence the distributiontree, typically having one source node of the content provider and manysinks being the consuming nodes of end-users at various locations aroundthe world. Methods have been developed as such for identifying such adistribution tree, which are not necessary to describe here in detailfor understanding of the solution.

Even though the consuming nodes are connected at different locations inthe network, the data flows thereto may take the same route from onenode to another such that all the data flows of the same content arerouted over one particular downstream data relaying node that isconnected to the delivering node. In this case, multiple data flows ofthe same content occur over the same link between these two nodes thuscausing redundancy by occupying multiple duplicated resources for thesame purpose, i.e. to send the same content in multiple equal data flowswithin a limited time span over the same link from the delivering nodeto the downstream data relaying node. In this solution, it is devisedthat these multiple data flows of the same content between two nodes canbe reduced to a single common data flow and still get the needed dataacross this link which is achieved by delegating the function ofdelivering node to the next downstream node. In this way, the contentcan be delivered to all consuming nodes but with less occupation ofresources and potentially also with reduced latency. This can beaccomplished by a method and a first node as follows.

A first example of how this solution can be realized in a first node toreduce load and latency in a data distribution network, will now bedescribed with reference to the flow chart in FIG. 1. This figureillustrates a procedure that is performed by the first node fordistributing a particular content, referred to as a “first” content, tomultiple consuming nodes connected to the data distribution network. Itis assumed that the first node initially operates as delivering node ofthe first content for the consuming nodes, i.e. it sends successivechunks of data of the content to the consuming nodes in response torequests therefrom in different sessions, thus generating correspondingdata flows.

In a first shown action 100, the first node detects multiple data flowsof the first content from the first node to a second node in thedistribution network. The second node is thus a downstream node, orchild, relative the first node in the distribution tree for thiscontent. The detected data flows are transferred approximately at thesame time but separately and independent of each other to the differentconsuming nodes and the first node detects that they all pass throughthe second node. The first node may be a source node controlled by aprovider of the first content, or a node further down the distributionnetwork topology which node is currently acting as delivering node. Inthe latter case, the first node may have cached the first content whenreceived from a source node, at some point, to shorten the delivery pathif that content is frequently demanded by consuming nodes, which is acommonly used procedure in the field of content delivery as describedabove.

For each one of these data flows there is an ongoing request—responseprocess, as described above, between the first node and the respectiveconsuming nodes for delivering the successive chunks of data. Each suchprocess and data flow require usage of resources in the first and secondnodes as well as bandwidth for transport of data, which are thusbasically the same in all the detected data flows between the first andsecond nodes, generating considerable resource and bandwidthconsumption. These parallel data flows can be reduced to a single commondata flow between the first and second nodes in the following actions,thus saving much of these resources and bandwidth. The first node thuseffectively detects in this action that there is redundancy downstreamin the distribution tree, i.e. at least in the communication with thesecond node.

The second node may be identified based on knowledge of the tree-shapedtopology of the data distribution network pertaining to delivery of thefirst content and further based on knowledge of locations of theconsuming nodes in this topology or distribution tree. Having identifiedthe second node as being a common data relaying node for the multipledata flows in action 100, the first node instructs the second node tooperate as delivering node of the first content for the consuming nodes,in a further action 102. This instruction to operate as delivering nodecan be made in several different ways. For example, in a cloudenvironment the first node may initiate creation of a VM or similarfunctionality in the second node of executing the role of deliveringnode, or this functionality may already be implemented in the secondnode, which alternatives will be elaborated in more detail later below.

In a following action 104, the first node also redirects the consumingnodes to use the second node as delivering node of the first content,i.e. instead of using the first node as their delivering node. As aresult, the consuming nodes receiving the respective data flows willestablish sessions with the second node and send their data requeststhereto instead of to the first node, which means that the delivery pathhas automatically been shortened by reducing the number of transfersteps by at least one, or even more if there is one or more intermediatenodes between the first and second nodes. In a further action 106, thefirst node also reduces the multiple data flows to a common data flow ofthe first content to the second node, thereby saving bandwidth andeliminating the redundancy over the link between the first and secondnodes. Also, processing resources are saved in both nodes by reducingthe number of data flows to a single data flow.

The above-described procedure is further illustrated by another exampleshown in the block diagram of FIG. 2, where a first node 200 delegatesthe function of delivering node to a second node 202, for distributingcontent to multiple consuming nodes C1, C2, C3, . . . A first action 2:1a illustrates that each of the consuming nodes C1, C2, C3, . . .repeatedly sends requests for data of a first content to the first node200 which responds by sending successive chunks of data of the contentto the consuming nodes in another action 2:1 b in multiple parallel butindependent data flows and sessions. Actions 2:1 a and 2:1 b thusillustrate the parts of an ongoing session of request—response for eachconsuming node as described above.

In another action 2:2, the first node 200 detects that there aremultiple parallel ongoing downstream data flows of the same contentroughly at the same time. The first node 200 also identifies thedownstream second node 202 to which all the data flows are directed, ina further action 2:3, e.g. based on knowledge of the topology of thedistribution tree in the data distribution network and of the locationsof the consuming nodes, as described above. The first node 200 thensends an instruction to the second node 202 to operate as deliveringnode of the first content for the consuming nodes, thus effectivelydelegating the function of delivering node, as shown in an action 2:4.This delegation of delivery function can be made in different ways, tobe described later below. For example, a VM 202 a may be established inthe second node 202 which is basically configured to cause the secondnode 202 to operate as delivering node by receiving and processing datarequests from the consuming nodes, among other things. The VM 202 a maybe “tailor-made” with enough capacity and functionality to meet thedemands from the consuming nodes which makes the solution “elastic”,i.e. adaptable and flexible.

The first node 200 also redirects the consuming nodes C1, C2, C3, . . .to use the second node as delivering node of the first content, as shownin another action 2:5. In this action, the first node 200 may send aredirect message to each and all of the consuming nodes asking them tosend their requests for data to the second node 202 instead of the firstnode 200. In another action 2:6, the first node 200 further terminatesany redundant data flows of the content sent downstreams to the secondnode 202, leaving just one common, or shared, data flow to the secondnode 202 which the latter can used for delivering data of the contentfurther downstreams towards the individual consuming nodes C1, C2, C3, .. . in response to data requests from the consuming nodes, as of action2:7. Thereby, the data flows start from the second node 202 instead ofthe first node 200 with one transfer step less than before.

Some further optional embodiments are possible when performing theprocedures depicted in FIG. 1 and FIG. 2. For example, the second nodemay be identified as a “lowest” downstream node forwarding the detectedmultiple data flows in the distribution tree, i.e. the second node islocated as close as possible to the consuming nodes. Thus it is possibleto delegate the delivering function to a node which is located anywherein the distribution tree which is not necessarily the next child nodedirectly connected to the first node In another possible embodiment,identifying the second node may comprise applying the so-calledDjikstra's algorithm for determining the shortest possible path from thefirst node to each of the consuming nodes in the topology, which will beelaborated further below. The Djikstra algorithm is just an example thatcan be used in this context and any other suitable algorithm orprocedure may be used for determining the above-mentioned shortestpossible path.

In another possible embodiment, detecting the multiple data flows maycomprise detecting, by the first node, that the number of the data flowsis above a first threshold. For example, it may be deemed unnecessary orunwarranted to delegate the function of delivering node to the secondnode when there are relatively few redundant data flows, i.e. less thanthe first threshold, which altogether do not burden the network andresources therein in a way that has any notable harmful impact on thenetwork capacity. This threshold may be set by a network operator, e.g.in consideration of network capacity and topology. The first thresholdmay further be node-specific, i.e. different for different nodes, e.g.in consideration of capacity of that node and/or its position in thenetwork topology. In general, when the first threshold has been set tox, the function of delivering node should be delegated downstreamswhenever x+1 or more data flows of the same content are detected.

In another possible embodiment, the delivering node may be disabled inthe second node when detecting that the number of data flows of thefirst content is lower than a second threshold. In general, when thesecond threshold has been set to y, the function of delivering nodeshould thus be disabled whenever no more than y−1 data flows of the samecontent are detected. Further, disabling the delivering node maycomprise redirecting the remaining consuming node(s) to use the firstnode again as delivering node of the first content.

As mentioned above, the above action of instructing the second node tooperate as delivering node of the first content can be made in severaldifferent ways, for example by establishing or creating a VM in thesecond node of executing the role of delivering node. In a firstexample, the first and second nodes may be part of a cloud environmentwhich includes a so-called “cloud manager” which is a single nodeoperative for creating and managing virtual resources in the cloud. Inthis case, the first node may send a request to the cloud manager tocreate a VM in the second node, thus indicating at which location the VMshall be created. Then, the first node receives a notification from thecloud manager indicating that the new VM has been activated and is upand running in the second node. The notification also comprises contactinformation of the VM such as an IP address. The first node is then ableto instruct the new VM in the second node to operate as delivering nodeof the first content in question for a set of consuming nodes, alsoinforming which parent node the second node has in the distributiontree, and to redirect the consuming nodes to the second node.

In a second example, the first node may contact a control function, suchas a so-called “hypervisor” or the like, in the second node to create anew VM directly in the second node, i.e. without involving a cloudmanager. The first node then detects when the new VM is up and running,e.g. by receiving a notification from the hypervisor of the second node.The first node is then able to instruct the new VM in the second node tooperate as delivering node of the first content for the consuming nodes,also informing which parent node the second node has in the distributiontree, and to redirect the consuming nodes to the second node.

In a third example, the second node has already been configured withsoftware required to operate as delivering node. In that case, the firstnode can directly instruct the second node to run this software tooperate as delivering node of the first content for the consuming nodes,also informing which parent node the second node has in the distributiontree. The latter example may be practiced also in a non-cloudenvironment.

Some examples of how delegation of the function of delivering node canpropagate downstreams in several steps in a distribution tree, and howthis function can be disabled in a node, will now be described withreference to FIGS. 3 a-f. In these examples, it is assumed that theabove-described first threshold has been set to one, meaning that thefunction of delivering node is delegated downstreams whenever two ormore data flows of the same content are detected.

Starting with FIG. 3 a, “S” denotes a source node operated by a contentprovider from which a first content is initially sent. “C1” and “C2”denote two consuming nodes which are currently watching the same contentroughly at the same time. The source node S initially operates asdelivering node of the first content and detects two parallel data flowsof the first content towards C1 and C2, respectively, illustrated as twodotted arrows: one from S to C1 and one from S to C2. The source node Salso identifies a downstream node denoted “N1” through which bothstreams are routed. Thus, N1 is identified as the lowest downstream nodein the distribution tree that forwards the two data flows in thetopology. It should be noted that both data flows may be routed over oneor more further nodes present between the nodes S1 and N1, although notshown here for simplicity.

Having detected the two data flows and identified N1, the deliveringnode S delegates its delivery function for C1 and C2 to node N1, whichmay be done according to any of the above-described procedures of FIG. 1and FIG. 2. As a result, node N1, which until now has only acted as adata relaying node, now starts to act as a delivering node, thus denoted“D1” in the next FIG. 2 b. Further, the source node S has terminated anyredundant data flow by reducing the two flows to a single common flow300 as illustrated by a single dashed arrow from S to D1 in FIG. 3 b. D1thus receives the content data from node S over the common flow anddistributes the same data in two separate data flows towards C1 and C2,respectively, as illustrated by two dotted arrows: one from D1 to C1 andone from D1 to C2. Compared to FIG. 3 a, these delivery paths have beenshortened by (at least) one step and a redundant data flow has beeneliminated from S to D1.

In the next FIG. 3 c, another consuming node “C3” has started to requestand receive the same first content from the source node S, asillustrated by a new dashed arrow from S to C3 routed over D1. In thiscase, the source node S delegates this delivery of the content to D1.Further, the delivering node D1 detects that there are two data flows ofthe first content being sent independently over a downstream child nodedenoted “N2”: the new flow to C3 and the flow to C2 previously delegatedto D1.

Therefore, the delivering node D1 delegates its delivery function for C2and C3 to node N2, e.g. according to any of FIG. 1 and FIG. 2, asindicated in FIG. 3 d. As a result, node N2, which until now has onlyacted as a data relaying node, starts to act as a delivering node, thusdenoted “D2” in the next FIG. 3 e. Further, the delivering node D1 hasterminated any redundant data flow by reducing the two flows to a singlecommon flow 302 to D2 as illustrated by a single dashed arrow from D1 toD2 in FIG. 3 e. D2 thus receives the content data from node D1 over thecommon data flow 302 and distributes the same data in two separate dataflows towards C2 and C3, respectively, as illustrated by two dottedarrows: one from D2 to C2 and one from D2 to C3. Compared to FIG. 3 c,these delivery paths have been shortened by (at least) one further stepand a redundant data flow has been eliminated from D1 to D2.

The next FIG. 3 f illustrates that the delivering node D2 detects thatthe data flow to C2 has been terminated and disables itself asdelivering node since it is no longer necessary to operate as deliveringnode for a single data flow, i.e. to C3. In general, the delivering nodemay be disabled in D2 when detecting that the number of data flows ofthe first content is lower than a second threshold which in this exampleis set to two. So when the second threshold has generally been set to y,the function of delivering node should be disabled whenever y−1 or lessdata flows of the same content are detected. Further, disabling thedelivering node may comprise redirecting the remaining consuming node(s)to use the first node as delivering node of the first content.

A detailed but non-limiting example of how a first node and a secondnode of a data distribution network may be structured with some possiblefunctional units to bring about the above-described operation of thefirst and second nodes, respectively, for distributing content tomultiple consuming nodes, is illustrated by the block diagram in FIG. 4.

The first node 400 comprises a delivery unit 400 a adapted to send dataflows with content over the distribution network. The first node 400further comprises a detecting unit 400 b adapted to detect multiple dataflows “MF” of a first content from the first node 400 to a second node402 in the distribution network when the first node 400 operates asdelivering node of the first content for a set of consuming nodes 404.

The first node 400 also comprises an instructing unit 400 c adapted toinstruct the second node 402 to operate as delivering node of the firstcontent for the consuming nodes 404. The first node 400 furthercomprises a redirecting unit 400 d adapted to redirect the consumingnodes 404 to use the second node 402 as delivering node of the firstcontent. The delivery unit 400 a is adapted to reduce the multiple dataflows to a common data flow “CF” of the first content to the second node402.

The above first node 400 and its functional units 400 a-d may beconfigured or adapted to operate according to various optionalembodiments. In a possible embodiment, the detecting unit 400 b may beadapted to identify the second node 402 based on knowledge of atree-shaped topology of the data distribution network pertaining todelivery of the first content and further based on knowledge oflocations of said consuming nodes in the topology. In that case, thedetecting unit 400 b may be further adapted to identify the second nodeas a lowest downstream node forwarding said data flows in the topology,i.e. such that the second node is located as close as possible to theconsuming nodes. The detecting unit 400 b may also be adapted toidentify the second node by applying Djikstra's algorithm fordetermining the shortest possible path from the first node to each ofthe consuming nodes in the topology.

In another possible embodiment,

The second node 402 comprises a receiving unit 402 a adapted to receivean instruction “In” from the first node 400 in the data distributionnetwork to operate as delivering node of a first content for theconsuming nodes when multiple data flows MF of the first content to thesecond node 402 have been detected in the first node 400. The secondnode 402 also comprises an operating unit 402 b adapted to operate asdelivering node of the first content by sending multiple data flows F1,F2, F3, . . . to the consuming nodes 404 while a common data flow CF ofthe first content is received from the first node 400.

The above second node 402 and its functional units 402 a and 402 b maybe configured or adapted to operate according to various optionalembodiments. In a possible embodiment, the operating unit 402 b may beadapted to disable the delivering node in the second node when detectingthat the number of data flows of the first content is lower than asecond threshold. In that case, the operating unit may further beadapted to redirect the consuming nodes to use the first node asdelivering node of the first content when disabling the delivering nodein the second node.

In another possible embodiment, the detecting unit 400 b may be adaptedto detect the multiple data flows by detecting that the number of saiddata flows is above a first threshold. In yet another possibleembodiment, when the first and second nodes are part of a cloudenvironment, the instructing unit 400 c may be adapted to instruct thesecond node to operate as delivering node by creating a virtual machineVM 402 c in the second node 402 for executing the role of deliveringnode.

An example of how this solution can be realized in a second node, beingconnected to a first node, to reduce load and latency in a datadistribution network, will now be described with reference to the flowchart in FIG. 5. This figure illustrates a procedure that is performedby the second node for distributing a particular content, referred to asa “first” content, to multiple consuming nodes connected to the datadistribution network. It is assumed that the first node initiallyoperates as delivering node of the first content for the consumingnodes, i.e. it sends successive chunks of data of the content to theconsuming nodes in response to requests therefrom in separate sessions,thus generating corresponding data flows.

In a first shown action 500, the second node receives an instructionfrom the first node in the data distribution network to operate asdelivering node of a first content for the consuming nodes when multipledata flows of the first content to the second node have been detected inthe first node. This action corresponds to actions 102 and 2:4 above. Ina further action 502, the second node accordingly operates as deliveringnode of the first content by sending multiple data flows to theconsuming nodes while a common data flow of the first content isreceived from the first node. This action corresponds to action 2:7above.

It should be noted that FIG. 4 illustrates various functional units inthe first and second nodes 400, 402 and the skilled person is able toimplement these functional units in practice using suitable software andhardware. Thus, the solution is generally not limited to the shownstructures of the first and second nodes 400, 402, and the functionalunits 400 a-d and 402 a-b may be configured to operate according to anyof the features described in this disclosure, where appropriate.

The functional units 400 a-d and 402 a-b described above can beimplemented in the first and second nodes 400, 402, respectively, bymeans of program modules of a respective computer program comprisingcode means which, when run by a processor “P” in each node causes thefirst and second nodes 400, 402 to perform the above-described actionsand procedures. Each processor P may comprise a single CentralProcessing Unit (CPU), or could comprise two or more processing units.For example, each processor P may include a general purposemicroprocessor, an instruction set processor and/or related chips setsand/or a special purpose microprocessor such as an Application SpecificIntegrated Circuit (ASIC). Each processor P may also comprise a storagefor caching purposes.

Each computer program may be carried by a computer program product ineach of the first and second nodes 400, 402 in the form of a memory “M”having a computer readable medium and being connected to the processorP. The computer program product or memory M in each node 400, 402 thuscomprises a computer readable medium on which the computer program isstored e.g. in the form of computer program modules “m”. For example,the memory M may be a flash memory, a Random-Access Memory (RAM), aRead-Only Memory (ROM) or an Electrically Erasable Programmable ROM(EEPROM), and the program modules m could in alternative embodiments bedistributed on different computer program products in the form ofmemories within the first and second nodes 400, 402.

Procedures have been described for finding redundant data flows andcalculating where in the distribution tree it is suitable to createand/or disable the function of delivering content, i.e. by delegatingand disabling a delivering node as described above, in order to minimizethis redundancy. A decision making process for this can be made in ahierarchical manner where each node in a distributed cloud isresponsible for optimizing resources below it in the distribution tree.Each node in the distributed cloud may be given the authority to createand disable delivering nodes in the cloud, including disabling itself ifneeded, when appropriate, e.g. as controlled by the above-mentionedfirst and second thresholds.

Virtual machines in a cloud environment are normally created throughuser interaction, e.g. to provide login credentials to a dashboard orcontrol interface where the user can control creation and management ofvirtual machines. In the solution presented in this disclosure, however,the necessary user intervention has been eliminated or at least reduced.An application which is bootstrapped initially by a controlling user maybe given full credentials in order to act automatically on behalf of theuser in order to autonomously create and disable delivering nodes whenit is warranted.

The task of finding redundant data flows in the network is given to eachdata relaying node of the network so that it detects if there isredundancy at some location downstreams in the tree. This may be donesimply by looking over a certain limited time-period how many uniqueconsuming nodes, or children, as identified by their IP addresses, haveaccessed the same content during the considered time-period, thus“roughly at the same time”. When the number of children consuming thesame content within the given time frame exceeds a certainpre-configured value, i.e. the first threshold, the data relaying nodehas detected redundant traffic flows which potentially could beoptimized by delegation of the delivering function.

An algorithm that can be used for finding out whether the network can beoptimized by delegation of the delivering function, may be the algorithmknown as the “Longest Common Path” calculation. First it applies theabove-mentioned Djikstra's algorithm for calculating the shortest pathsfrom the source node over the data relaying node and towards theconsuming nodes, i.e. all the children that has requested the samecontent within the given time period.

Given all the shortest paths, the algorithm then attempts to “walk down”the paths step by step towards all the consuming nodes, for each stepkeeping track of how many children nodes still remain below. Initially,the set of children comprises all the consuming nodes that has requestedthe same content and for each time a branch is observed when followingthe shortest paths towards the children, the children are removed fromthe set and the search is continued down all the branches until,eventually, the set is reduced to contain only one child. The algorithmoutputs a set of branching locations in the network where data flows arebeing split in different directions, and all these branching locationscould potentially be suitable for creating new delivering nodes as theycould reduce redundancy in the network.

A more detailed example of how the above-described first and secondnodes may act when distributing content to multiple consuming nodesconnected to the data distribution network, will now be described withreference to the flow charts in FIGS. 6 a and 6 b. FIG. 6 a showsactions to be performed by the first node while FIG. 6 b shows actionsto be performed by the second node. In a first action 600, the firstnode acts as delivering node of the first content, e.g. when being asource node or a previously appointed delivering node. In a next shownaction 602, the first node detects multiple data flows of the firstcontent, e.g. basically as described for actions 100 and 2:2 above.

The first node then determines whether the number of detected data flowsis above a first threshold, in an action 604. If not, the process mayreturn to action 600 where the first node continues to act as deliveringnode. On the other hand, if the number of detected data flows is abovethe first threshold, the first node identifies the lowest downstreamnode that forwards the detected multiple data flows, in this case thesecond node, in an action 606, e.g. basically as described for action2:3 above. The first node then delegates the delivering function byinstructing the second node to operate as the delivering node, andredirects the consuming nodes to use the second node as their deliveringnode, in an action 608, e.g. basically as described for actions 102 and2:4 above. In this action, redundancy is also eliminated by reducing thedata flows from the first node to the second node to a common data flowof the first content.

Moving to FIG. 6 b, the second node receives the instruction from thefirst node and then operates as delivering node of the first contentaccording to the instruction from the first node, in another action 610.In a next shown action 612, the second node detects that there are oneor more ongoing data flows of the first content to one or more of theconsuming nodes, i.e. one or more of the sessions and data flows mayhave been terminated since the second node was delegated the role ofdelivering node. The second node thus determines, in a further action614, whether the number of detected data flows is below a secondthreshold. If not, the process may return to action 610 where the secondnode continues to act as delivering node. On the other hand, if thenumber of detected data flows is below the second threshold, the secondnode disables the delivering node or function and redirects theremaining consuming node(s), still receiving a data flow of the firstcontent, to use the upstream first node again as their delivering node,in a final shown action 616.

Some advantages that may be achieved when using any of the embodimentsdescribed herein include a self-organizing network for contentdistribution which automatically adapts the delivering operation to theprevailing situation of consuming nodes, which does not require anymanual work or special supervision of the network. Further, capacity inthe network such as resources and bandwidth can be utilized with greaterefficiency by eliminating redundancy in terms of data flows and sessionsbetween the nodes for distributing content.

While the solution has been described with reference to specificexemplary embodiments, the description is generally only intended toillustrate the inventive concept and should not be taken as limiting thescope of the solution. For example, the terms “data flow”, “content”,“delivering node”, and “consuming node” have been used throughout thisdescription, although any other corresponding entities, functions,and/or parameters could also be used having the features andcharacteristics described here. The solution is defined by the appendedclaims.

1-18. (canceled)
 19. A method performed by a first node in a datadistribution network, for distributing content to multiple consumingnodes connected to the data distribution network, the method comprising:detecting multiple data flows of a first content from the first node toa second node in the distribution network when the first node operatesas delivering node of the first content for the consuming nodes;instructing the second node to operate as delivering node of the firstcontent for the consuming nodes; redirecting the consuming nodes to usethe second node as delivering node of the first content; and reducingthe multiple data flows to a common data flow of the first content tothe second node.
 20. The method of claim 19, further comprisingidentifying the second node based on knowledge of a tree-shaped topologyof the data distribution network pertaining to delivery of the firstcontent and further based on knowledge of locations of said consumingnodes in the topology.
 21. The method of claim 20, wherein the secondnode is identified as a lowest downstream node forwarding said dataflows in the topology, the second node being located as close aspossible to the consuming nodes.
 22. The method of claim 20, whereinidentifying the second node comprises applying Djikstra's algorithm fordetermining the shortest possible path from the first node to each ofthe consuming nodes in the topology.
 23. The method of claim 19, whereindetecting the multiple data flows comprises detecting that the number ofsaid data flows is above a first threshold.
 24. The method of claim 19,wherein the first and second nodes are part of a cloud environment andthe second node is instructed to operate as delivering node by creatinga virtual machine in the second node for executing the role ofdelivering node.
 25. A first node in a data distribution network, thefirst node being configured to distribute content to multiple consumingnodes connected to the data distribution network, the first nodecomprising processing circuitry configured to: send data flows withcontent over the distribution network; detect multiple data flows of afirst content from the first node to a second node in the distributionnetwork when the first node operates as delivering node of the firstcontent for the consuming nodes; instruct the second node to operate asdelivering node of the first content for the consuming nodes; andredirect the consuming nodes to use the second node as delivering nodeof the first content, wherein the processing circuitry is configured toreduce the multiple data flows to a common data flow of the firstcontent to the second node.
 26. A first node according to claim 25,wherein the processing circuitry is configured to identify the secondnode based on knowledge of a tree-shaped topology of the datadistribution network pertaining to delivery of the first content andfurther based on knowledge of locations of said consuming nodes in thetopology.
 27. A first node according to claim 26, wherein the processingcircuitry is configured to identify the second node as a lowestdownstream node forwarding said data flows in the topology, the secondnode being located as close as possible to the consuming nodes.
 28. Afirst node according to claim 26, wherein the processing circuitry isconfigured to identify the second node by applying Djikstra's algorithmfor determining the shortest possible path from the first node to eachof the consuming nodes in the topology.
 29. A first node according toclaim 25, wherein the processing circuitry is configured to detect themultiple data flows by detecting that the number of said data flows isabove a first threshold.
 30. A first node according to claim 25, whereinthe first and second nodes are part of a cloud environment, and theprocessing circuitry is configured to instruct the second node tooperate as delivering node by creating a virtual machine in the secondnode for executing the role of delivering node.
 31. A method performedby a second node in a data distribution network, for distributingcontent to multiple consuming nodes connected to the data distributionnetwork, the method comprising: receiving an instruction from a firstnode in the data distribution network to operate as delivering node of afirst content for the consuming nodes when multiple data flows of thefirst content to the second node have been detected in the first node;and operating as delivering node of the first content by sendingmultiple data flows to the consuming nodes while a common data flow ofthe first content is received from the first node.
 32. The method ofclaim 31, further comprising disabling the delivering node in the secondnode when detecting that the number of data flows of the first contentis lower than a second threshold.
 33. The method of claim 32, whereindisabling the delivering node comprises redirecting the consuming nodesto use the first node as delivering node of the first content.
 34. Asecond node in a data distribution network, the second node beingconfigured to distribute content to multiple consuming nodes connectedto the data distribution network, the second node comprising processingcircuitry configured to: receive an instruction from a first node in thedata distribution network to operate as delivering node of a firstcontent for the consuming nodes when multiple data flows of the firstcontent to the second node have been detected in the first node; andoperate as delivering node of the first content by sending multiple dataflows to the consuming nodes while a common data flow of the firstcontent is received from the first node.
 35. A second node according toclaim 34, wherein the processing circuitry is configured to disable thedelivering node in the second node when detecting that the number ofdata flows of the first content is lower than a second threshold.
 36. Asecond node according to claim 35, wherein the processing circuitry isconfigured to redirect the consuming nodes to use the first node asdelivering node of the first content when disabling the delivering nodein the second node.